Practical Analysis of Logic Programs with Delay ( Extended Abstract )
نویسندگان
چکیده
The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness.A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. A simple prototype implementation has been built applying some of these methods to our analysis, and at this initial stage has achieved accurate results in promising times.
منابع مشابه
Verifying Partial Correctness of Logic Programs with Delay Declarations
In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It diiers from the deenition of SLD-derivation since more instantiated general uniiers are computed instead of standard mgus. The contribution of this paper follows from the observation that the derivations of logic programs ...
متن کاملPractical Model-Based Static Analysis for Definite Logic Programs
The declarative semantics of de nite logic programs is the basis of an elegant and practical framework for their static analysis. We de ne a core semantics parameterised by a preinterpretation of the language underlying the program. The concrete semantics is given by an extended Herbrand interpretation, capturing the correct answers of a program. The semantics is computed as the least xed point...
متن کاملOperational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations
We draw concrete and abstract operational semantics towards the analysis of logic programs with delay declarations. This is the basis to generalize the abstract interpreter GAIA to deal with logic programs employing dynamic scheduling. The concrete and abstract semantics are introduced explicitly and express both deadlock information and qualified answers. Sure deadlock and sure no deadlock inf...
متن کاملReexecution-Based Analysis of Logic Programs with Delay Declarations
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.
متن کاملAnalysis of Logic Programs with Delay
The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness. A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. An implementation has been built which shows that...
متن کامل